Bucket Hashing and its Application
نویسنده
چکیده
We introduce a new technique for constructing a family of universal hash functions. At its center is a simple metaphor: to hash a string x, cast each of its words into a small number of buckets; xor the contents of each bucket; then collect up all the buckets' contents. Used in the context of Wegman{Carter authentication, this style of hash function provides a fast approach for software message authentication.
منابع مشابه
Extendible Chained Bucket Hashing for Main Memory Databases
The objective of this paper is to develop a high performance hash-based access method for main memory database systems. Chained bucket hashing is known to provide the fastest random access to a static file stored in main memory. For a dynamic file, however, chained bucket hashing is inappropriate because its address space cannot be adapted to the file size without total reorganization. Extendib...
متن کاملL Linear Hashing
Linear Hashing is a dynamically updateable diskbased index structure which implements a hashing scheme and which grows or shrinks one bucket at a time. The index is used to support exact match queries, i.e., find the record with a given key. Compared with the BC-tree index which also supports exact match queries (in logarithmic number of I/Os), Linear Hashing has better expected query cost O(1)...
متن کاملBucket Hashing with a Small Key Size
In this paper we consider very fast evaluation of strongly universal hash functions, or equivalently, authentication codes. We show how it is possible to modify some known families of hash functions into a form such that the evaluation is similar to \bucket hashing", a technique for very fast hashing introduced by Rogaway. Rogaway's bucket hash family has a huge key size, which for common param...
متن کاملLinear Hashing
DEFINITION Linear Hashing is a dynamically updateable disk-based index structure which implements a hashing scheme and which grows or shrinks one bucket at a time. The index is used to support exact match queries, i.e. find the record with a given key. Compared with the B+-tree index which also supports exact match queries (in logarithmic number of I/Os), Linear Hashing has better expected quer...
متن کاملImage authentication using LBP-based perceptual image hashing
Feature extraction is a main step in all perceptual image hashing schemes in which robust features will led to better results in perceptual robustness. Simplicity, discriminative power, computational efficiency and robustness to illumination changes are counted as distinguished properties of Local Binary Pattern features. In this paper, we investigate the use of local binary patterns for percep...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997